-
1 булева схема
Mathematics: Boolean design, Boolean network, Boolean scheme -
2 disponer de
v.1 to have, to call on, to call upon, to have at one's disposal.Yo dispongo de mucho dinero I have lots of money.2 to count on.El gerente dispuso del personal The manager counted on the staff.* * *(v.) = command, have + in place, make + use of, have at + Posesivo + disposalEx. A well-considered ideology cognizant of the nature of the materials cataloged is prerequisite and fundamental to the design of any viable cataloging system, and particularly one that is to command universal acceptance.Ex. The first country to have in place an operational domestic geostationary satellite communications system was Canada.Ex. The example search in figure 8.3 shows how the statements in an online search make use of Boolean logic operators.Ex. But this would require time and competencies, which not all policy makers have at their disposal.* * *(v.) = command, have + in place, make + use of, have at + Posesivo + disposalEx: A well-considered ideology cognizant of the nature of the materials cataloged is prerequisite and fundamental to the design of any viable cataloging system, and particularly one that is to command universal acceptance.
Ex: The first country to have in place an operational domestic geostationary satellite communications system was Canada.Ex: The example search in figure 8.3 shows how the statements in an online search make use of Boolean logic operators.Ex: But this would require time and competencies, which not all policy makers have at their disposal. -
3 анализ дерева отказов (в информационных технологиях)
анализ дерева отказов
FTA
(ITIL Service Design)
(ITIL Continual Service Improvement)
Техника, которая может использоваться для определения цепочки событий, которые привели к инциденту. Анализ дерева отказов, используя Булеву нотацию, представляет цепь событий в виде диаграммы.
[Словарь терминов ITIL версия 1.0, 29 июля 2011 г.]EN
fault tree analysis
FTA
(ITIL Continual Service Improvement)
(ITIL Service Design)
A technique that can be used to determine a chain of events that has caused an incident, or may cause an incident in the future. Fault tree analysis represents a chain of events using Boolean notation in a diagram.
[Словарь терминов ITIL версия 1.0, 29 июля 2011 г.]Тематики
Синонимы
EN
Русско-английский словарь нормативно-технической терминологии > анализ дерева отказов (в информационных технологиях)
-
4 Shannon, Claude Elwood
[br]b. 30 April 1916 Gaylord, Michigan, USA[br]American mathematician, creator of information theory.[br]As a child, Shannon tinkered with radio kits and enjoyed solving puzzles, particularly crypto-graphic ones. He graduated from the University of Michigan in 1936 with a Bachelor of Science in mathematics and electrical engineering, and earned his Master's degree from the Massachusetts Institute of Technology (MIT) in 1937. His thesis on applying Boolean algebra to switching circuits has since been acclaimed as possibly the most significant this century. Shannon earned his PhD in mathematics from MIT in 1940 with a dissertation on the mathematics of genetic transmission.Shannon spent a year at the Institute for Advanced Study in Princeton, then in 1941 joined Bell Telephone Laboratories, where he began studying the relative efficiency of alternative transmission systems. Work on digital encryption systems during the Second World War led him to think that just as ciphers hide information from the enemy, "encoding" information could also protect it from noise. About 1948, he decided that the amount of information was best expressed quantitatively in a two-value number system, using only the digits 0 and 1. John Tukey, a Princeton colleague, named these units "binary digits" (or, for short, "bits"). Almost all digital computers and communications systems use such on-off, or two-state logic as their basis of operation.Also in the 1940s, building on the work of H. Nyquist and R.V.L. Hartley, Shannon proved that there was an upper limit to the amount of information that could be transmitted through a communications channel in a unit of time, which could be approached but never reached because real transmissions are subject to interference (noise). This was the beginning of information theory, which has been used by others in attempts to quantify many sciences and technologies, as well as subjects in the humanities, but with mixed results. Before 1970, when integrated circuits were developed, Shannon's theory was not the preferred circuit-and-transmission design tool it has since become.Shannon was also a pioneer in the field of artificial intelligence, claiming that computing machines could be used to manipulate symbols as well as do calculations. His 1953 paper on computers and automata proposed that digital computers were capable of tasks then thought exclusively the province of living organisms. In 1956 he left Bell Laboratories to join the MIT faculty as Professor of Communications Science.On the lighter side, Shannon has built many devices that play games, and in particular has made a scientific study of juggling.[br]Principal Honours and DistinctionsNational Medal of Science. Institute of Electrical and Electronics Engineers Medal of Honor, Kyoto Prize.BibliographyHis seminal paper (on what has subsequently become known as information theory) was entitled "The mathematical theory of communications", first published in Bell System Technical Journal in 1948; it is also available in a monograph (written with Warren Weaver) published by the University of Illinois Press in 1949, and in Key Papers in the Development of Information Theory, ed. David Slepian, IEEE Press, 1974, 1988. For readers who want all of Shannon's works, see N.J.A.Sloane and A.D.Wyner, 1992, TheCollected Papers of Claude E.Shannon.HO
См. также в других словарях:
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
Boolean operations on polygons — are a set of Boolean operations (AND, OR, NOT, XOR, etc.) operating on one or more sets of polygons. These sets of operations are widely used in computer graphics, CAD, and in EDA (in integrated circuit physical design and verification… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Design rule checking — or Check(s) (DRC) is the area of Electronic Design Automation that determines whether the physical layout of a particular chip layout satisfies a series of recommended parameters called Design Rules. Design rule checking is a major step during… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Boolean function — In mathematics, a (finitary) Boolean function is a function of the form f : B k rarr; B, where B = {0, 1} is a Boolean domain and k is a nonnegative integer called the arity of the function. In the case where k = 0, the function is essentially a… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean algebra — /booh lee euhn/ 1. Logic. a deductive logical system, usually applied to classes, in which, under the operations of intersection and symmetric difference, classes are treated as algebraic quantities. 2. Math. a ring with a multiplicative identity … Universalium
Design Patterns — Not to be confused with the concept of a Design pattern. Design Patterns: Elements of Reusable Object Oriented Software … Wikipedia
